Quantum graph

Results: 84



#Item
11Quantum query complexity of minor-closed graph properties Andrew M. Childs and Robin Kothari Department of Combinatorics & Optimization and Institute for Quantum Computing University of Waterloo

Quantum query complexity of minor-closed graph properties Andrew M. Childs and Robin Kothari Department of Combinatorics & Optimization and Institute for Quantum Computing University of Waterloo

Add to Reading List

Source URL: qip2011.quantumlah.org

Language: English - Date: 2011-01-11 05:14:56
    12Monoidal Theories and Graph Rewriting in Quantum Computing Aleks Kissinger Lucas Dixon

    Monoidal Theories and Graph Rewriting in Quantum Computing Aleks Kissinger Lucas Dixon

    Add to Reading List

    Source URL: dream.inf.ed.ac.uk

    Language: English - Date: 2009-11-09 13:01:36
      13Quantum query complexity of minor-closed graph properties Andrew M. Childs∗ Robin Kothari†  Department of Combinatorics & Optimization

      Quantum query complexity of minor-closed graph properties Andrew M. Childs∗ Robin Kothari† Department of Combinatorics & Optimization

      Add to Reading List

      Source URL: qip2011.quantumlah.org

      Language: English - Date: 2011-01-11 05:19:49
        14New bounds on the classical and quantum communication complexity of some graph properties∗ Gábor Ivanyos1 , Hartmut Klauck2 , Troy Lee3 , Miklos Santha4 , and Ronald de Wolf5 1

        New bounds on the classical and quantum communication complexity of some graph properties∗ Gábor Ivanyos1 , Hartmut Klauck2 , Troy Lee3 , Miklos Santha4 , and Ronald de Wolf5 1

        Add to Reading List

        Source URL: drops.dagstuhl.de

        Language: English - Date: 2012-12-10 08:58:52
          15Sketching Earth-Mover Distance on Graph Metrics? Andrew McGregor and Daniel Stubbs University of Massachusetts Amherst 140 Governors Drive, Amherst, MA 01003 {mcgregor,dstubbs}@cs.umass.edu

          Sketching Earth-Mover Distance on Graph Metrics? Andrew McGregor and Daniel Stubbs University of Massachusetts Amherst 140 Governors Drive, Amherst, MA 01003 {mcgregor,dstubbs}@cs.umass.edu

          Add to Reading List

          Source URL: people.cs.umass.edu

          Language: English - Date: 2013-06-17 11:57:08
          16MIT-CTP #3309  Exponential algorithmic speedup by quantum walk Andrew M. Childs,1, ∗ Richard Cleve,2, † Enrico Deotto,1 , ‡ Edward Farhi,1, § Sam Gutmann,3, ¶ and Daniel A. Spielman4, ∗∗

          MIT-CTP #3309 Exponential algorithmic speedup by quantum walk Andrew M. Childs,1, ∗ Richard Cleve,2, † Enrico Deotto,1 , ‡ Edward Farhi,1, § Sam Gutmann,3, ¶ and Daniel A. Spielman4, ∗∗

          Add to Reading List

          Source URL: arxiv.org

          Language: English - Date: 2008-02-01 00:39:23
          17Dense Graphs, Node Sets, and Riders: Toward a Foundation for Particle Physics without Continuum Mathematics

          Dense Graphs, Node Sets, and Riders: Toward a Foundation for Particle Physics without Continuum Mathematics

          Add to Reading List

          Source URL: www.complex-systems.com

          Language: English - Date: 2012-06-20 13:21:03
          18Microsoft Word - Document1

          Microsoft Word - Document1

          Add to Reading List

          Source URL: www.cmsim.org

          Language: English - Date: 2015-05-19 15:49:12
          19Susan Margulies margulie at usna dot edu United States Naval Academy, Department of Mathematics, Annapolis, MDResearch Interests Optimization, Graph Theory, Computer Algebra, Algorithms and Complexity, Quantum Com

          Susan Margulies margulie at usna dot edu United States Naval Academy, Department of Mathematics, Annapolis, MDResearch Interests Optimization, Graph Theory, Computer Algebra, Algorithms and Complexity, Quantum Com

          Add to Reading List

          Source URL: www.usna.edu

          Language: English - Date: 2015-05-19 21:11:47
          20114  Chapter 11 Hard Problems This chapter is on “hard” problems in distributed computing. In sequential computing, there are NP-hard problems which are conjectured to take exponential

          114 Chapter 11 Hard Problems This chapter is on “hard” problems in distributed computing. In sequential computing, there are NP-hard problems which are conjectured to take exponential

          Add to Reading List

          Source URL: dcg.ethz.ch

          Language: English - Date: 2014-09-26 08:28:48